Description and Representation of the Problems selected for the First International Constraint Satisfaction Solver Competition
نویسندگان
چکیده
In this paper, we present the problems that have been selected for the first international competition of CSP solvers. First, we introduce a succinct description of each problem and then, we present the two formats that have been used to represent the CSP instances.
منابع مشابه
SUNNY with Algorithm Configuration
The SUNNY algorithm is a portfolio technique originally tailored for Constraint Satisfaction Problems (CSPs). SUNNY allows to select a set of solvers to be run on a given CSP, and was proven to be effective in the MiniZinc Challenge, i.e., the yearly international competition for CP solvers. In 2015, SUNNY was compared with other solver selectors in the first ICON Challenge on algorithm selecti...
متن کاملSimulation of Strap-On Boosters Separation in the Atmosphere
A numerical dynamic-aerodynamic interface for simulating the separation dynamics of constrained strap-on boosters jettisoned in the atmosphere is presented. A 6-DOF multi body dynamic solver ،using Constraint Force Equation Methodology is coupled with a numerical time dependent Euler flow solver. An automatic dynamic mesh updating procedure is employed using smoothing and l...
متن کاملSolving XCSP problems by using Gecode
Gecode is one of the most efficient libraries that can be used for constraint solving. However, using it requires dealing with C++ programming details. On the other hand several formats for representing constraint networks have been proposed. Among them, XCSP has been proposed as a format based on XML which allows us to represent constraints defined either extensionally or intensionally, permit...
متن کاملProblem Solving by General Purpose Solvers
To solve problems abundant in real world applications, we have been proposing an approach of using general purpose solvers, since we cannot afford to develop special purpose algorithms for all individual problems. For this purpose, we have developed solvers for some standard problems such as CSP (constraint satisfaction problem), RCPSP (resource constrained project scheduling problem), GAP (gen...
متن کاملConfirming the QSR Promise
Within the qualitative spatial reasoning community it has been a widely accepted commonplace that reasoning in qualitative constraint calculi outperforms reasoning in other more general and expressive formalisms. To check the correctness of this assumption we conducted some empirical case studies in which we compared the performance of a qualitative constraint solver with different automated re...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005